On Potentially Abelian Geometric Representations

The finiteness is proved of the set of isomorphism classes of potentially abelian geometric Galois representations with a given set of data. This is a special case of the finiteness conjecture of Fontaine and Mazur.     

Minimal Submanifolds in a Locally Symmetric and Conformally Flat Space

We study minimal submanifolds in the locally symmetric and conformally flat Riemannian manifold and generalize Yau's result obtained in J. Amer. Math. 97 (1975), 76–100.     

Rank-perfect and" weakly rank-perfect graphs

An edge e of a perfect graph G is critical if G−e is imperfect. We would like to decide whether G−e is still “almost perfect” or already “very imperfect”. Via relaxations of the stable set polytope of a graph, we define two superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph of a bipartite graph or from the complement of such a graph.     

Stable multi-sets

In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge bounds equal one, stable multi-sets are equivalent to stable sets.  For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable multi-sets and conditions for them to be facet defining are determined.  The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets emerge as an important substructure in the design of optical networks. Received: February 14, 2001/Revised version: September 7, 2001     

Commuting and stable feedback design for switched linear systems

In the paper, commuting and stable feedback design for switched linear systems is investigated. This problem is formulated as to build up suitable state feedback controller for each subsystem such that the closed-loop systems are not only asymptotically stable but also commuting each other. A new concept, common admissible eigenvector set (CAES), is introduced to establish necessary/sufficient conditions for commuting and stable feedback controllers. For second-order systems, a necessary and sufficient condition is established. Moreover, a parametrization of the CAES is also obtained. The motivation comes from stabilization of switched linear systems which consist of a family of LTI systems and a switching law specifying the switching between them, where if all the subsystems are stable and commuting each other, then the total system is stable under arbitrary switching.     

Ricci and Matter Collineations of Locally Rotationally Symmetric Space-Times

A new method is presented for the determination of Ricci Collineations (RC) and Matter Collineations (MC) of a given spacetime, in the cases where the Ricci tensor and the energy momentum tensor are non-degenerate and have a similar form with the metric. This method reduces the problem of finding the RCs and the MCs to that of determining the KVs whereas at the same time uses already known results on the motions of the metric. We employ this method to determine all hypersurface homogeneous locally rotationally symmetric spacetimes, which admit proper RCs and MCs. We also give the corresponding collineation vectors. These results conclude a long due open problem, which has been considered many times partially in the literature.     

Hamiltonian N2‐locally connected claw‐free graphs

A graph G is N₂‐locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent to ν in G induce a connected graph. In 1990, Ryjá?ek conjectured that every 3‐connected N₂‐locally connected claw‐free graph is Hamiltonian. This conjecture is proved in this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005     

Probability Interpretation of the Integral of Fractional Order

We establish a relation between stable distributions in probability theory and the fractional integral. Moreover, it turns out that the parameter of the stable distribution coincides with the exponent of the fractional integral. It follows from an analysis of the obtained results that equations with the fractional time derivative describe the evolution of some physical system whose time degree of freedom becomes stochastic, i.e., presents a sum of random time intervals subject to a stable probability distribution. We discuss relations between the fractal Cantor set (Cantor strips) and the fractional integral. We show that the possibility to use this relation as an approximation of the fractional integral is rather limited.     

ITERATIVE APPROXIMATION OF FIXED POINTS OF NON-LIPSCHITZIAN ASYMPTOTICALLY PSEUDOCONTRACTIVE MAPPINGS

The purpose of this paper is to investigate the problem of approximating fixed points of non-Lipschitizian asymptotically pseudocontractive mappings in an arbitrary real Banach space by the modified Ishikawa iterative sequences with errors.     

Stable Ergodicity and Frame Flows

In this note we show that all diffeomorphisms close enough to the time-one map of the frame flow on certain negatively curved manifolds are ergodic. As a simple corollary we deduce that the frame flows are ergodic for all compact manifolds with curvature pinched sufficiently close to –1, thus providing results in the case of manifolds of dimension 7 or 8 which were missing from the results of Brin and Karcher.